Solving CSPs with Naming Games
نویسندگان
چکیده
Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the naming games. The naming game was introduced to represent N agents that have to bootstrap an agreement on a name to give to an object. The agents do not have a hierarchy and use a minimal protocol. Still they converge to a consistent state by using a distributed strategy. For this reason the naming game can be used to untangle distributed constraint solving problems (DCSPs). Moreover it represents a good starting point for a systematic study of DCSP methods, which can be seen as further improvement of
منابع مشابه
Solving matrix games with hesitant fuzzy pay-offs
The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...
متن کاملComparison of the effectiveness of cognitive computer games and parent-child interactive games on problem solving and positive and negative affect of ten-year-old children in Shiraz
In recent years, research on increasing cognitive and psychological status through play has received much attention. For this purpose, there are two categories of game including interactive home game and cognitive game that the first run in the home environment and the latter is implemented as computer software to increase cognitive abilities. The aim of this study was to compare the effectiven...
متن کاملThe Multiple Word Guessing Game
In this paper I bring together a number of insights in the field of semiotic dynamics. Inspired by recent advances in the understanding of the naming game and by previous attempts to define stages in the formation of lexical languages, we define two classes of language game problems called the single and multiple word guessing games. By being more complex than naming games, but not as complex a...
متن کاملThe effect of Electronic puzzle Games on Improving Reading Performance of Students with learning disorders
The purpose of this study was to investigate the effect of Electronic puzzle Games on improving the reading performance of students with learning disorders in Gorgan. The research was applied to the target and quasi-experimental, pre-test and post-test design with control group. The statistical population consisted of 255 female students of Shokufa and Dena provincial centers and non-profit cen...
متن کاملAn E cient Heuristic - Based Evolutionary Algorithm for SolvingConstraint Satisfaction ProblemsVincent
GENET and EGENET are artiicial neural networks with remarkable success in solving hard constraint satisfaction problems (CSPs) such as car se-quencing problems. (E)GENET uses the min-connict heuristic in variable updating to nd local minima, and then applies heuristic learning rule(s) to escape the local minima not representing solution(s). In this paper we describe a micro-genetic algorithm (M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008